General parameterized proximal point algorithm with applications in statistical learning
نویسندگان
چکیده
منابع مشابه
A novel parameterized proximal point algorithm with applications in statistical learning
In the literature, there are a few researches for the proximal point algorithm (PPA) with some parameters designed in the metric proximal matrix, especially for the multi-objective optimization problems. Introducing some parameters to the PPA can make it more attractive and flexible. By using the unified framework of the classical PPA and constructing a parameterized proximal matrix, in this pa...
متن کاملA parameterized proximal point algorithm for separable convex optimization
In this paper, we develop a parameterized proximal point algorithm (PPPA) for solving a class of separable convex programming problems subject to linear and convex constraints. The proposed algorithm is provable to be globally convergent with a worst-case O(1/t) convergence rate, where t denotes the iteration number. By properly choosing the algorithm parameters, numerical experiments on solvin...
متن کاملA proximal point algorithm converging strongly for general errors
In this paper a proximal point algorithm (PPA) for maximal monotone operators with appropriate regularization parameters is considered. A strong convergence result for PPA is stated and proved under the general condition that the error sequence tends to zero in norm. Note that R.T. Rockafellar (1976) assumed summability for the error sequence to derive weak convergence of PPA in its initial for...
متن کاملA Proximal Point Algorithm for Sequential Feature Extraction Applications
We propose a proximal point algorithm to solve LAROS problem, that is the problem of finding a “large approximately rank-one submatrix”. This LAROS problem is used to sequentially extract features in data. We also develop a new stopping criterion for the proximal point algorithm, which is based on the duality conditions of ǫ-optimal solutions of the LAROS problem, with a theoretical guarantee. ...
متن کاملOn over-relaxed (A,η,m)-proximal point algorithm frameworks with errors and applications to general variational inclusion problems
The purpose of this paper is to provide some remarks for the main results of the paper Verma (Appl. Math. Lett. 21:142-147, 2008). Further, by using the generalized proximal operator technique associated with the (A,η,m)-monotone operators, we discuss the approximation solvability of general variational inclusion problem forms in Hilbert spaces and the convergence analysis of iterative sequence...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Mathematics
سال: 2018
ISSN: 0020-7160,1029-0265
DOI: 10.1080/00207160.2018.1427854